Extremal classical interpolation problems (matrix case)
نویسندگان
چکیده
منابع مشابه
Extremal Problems of Interpolation Theory
We consider problems where one seeks m×m matrix valued H∞ functions w(ξ) which satisfy interpolation constraints and a bound (0.1) w∗(ξ)w(ξ) ≤ ρmin, |ξ| < 1, where the m×m positive semi-definite matrix ρmin is minimal (no smaller than) any other matrix ρ producing such a bound. That is, if (0.2) w∗(ξ)w(ξ) ≤ ρ, |ξ| < 1, and if ρmin − ρ is positive semi-definite, then ρmin = ρ. This is an example...
متن کاملExtremal problems, inequalities, and classical orthogonal polynomials
In this survey paper we give a short account on characterizations for very classical orthogonal polynomials via extremal problems and the corresponding inequalities. Beside the basic properties of the classical orthogonal polynomials we consider polynomial inequalities of Landau and Kolmogoroff type, some weighted polynomial inequalities in L2-norm of Markov-Bernstein type, as well as the corre...
متن کاملOn Degenerate Interpolation, Entropy and Extremal Problems for Matrix Schur Functions
We consider a general bitangential interpolation problem for matrix Schur functions and focus mainly on the case when the associated Pick matrix is singular (and positive semidefinite). Descriptions of the set of all solutions are given in terms of special linear fractional transformations which are obtained using two quite different approaches. As applications of the obtained results we consid...
متن کاملExtremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric
A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...
متن کاملExtremal Graph Problems, Degenerate Extremal Problems, and Supersaturated Graphs
Notation. Given a graph, hypergraph Gn, . . . , the upper index always denotes the number of vertices, e(G), v(G) and χ(G) denote the number of edges, vertices and the chromatic number of G respectively. Given a family L of graphs, hypergraphs, ex(n,L) denotes the maximum number of edges (hyperedges) a graph (hypergraph)Gn of order n can have without containing subgraphs (subhypergraphs) from L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2009
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.09.013